A P systems variant for reasoning about sequential controllability of Boolean networks

A Boolean network is a discrete dynamical system operating on vectors of variables. The action can be conveniently expressed as update functions, computing the new values for each component vector function other components. networks are widely used in modelling biological systems that seen consisting entities which activated or deactivated, inhibited, off. P hand classically introduced model hierarchical multiset rewriting. However, over years community has proposed wide range variants including diverse ingredients suited various needs. In this work, we propose variant—Boolean systems—specifically designed reasoning about sequential controllability networks, and use it to first establish crisp formalization problem, then prove problem PSPACE-complete. We further claim demonstration how construct ad hoc formalisms, custom-tailored specific problems, providing advantageous points view.